Facial Age Estimation by Learning from Label Distributions.

Functionalization of microarray devices Process optimization using a multiobjective PSO and multiresponse MARS modeling.
Abstract—An evolutionary approach for the optimization of microarray coatings produced via sol-gel chemistry is presented. The aim of the methodology is to face the challenging aspects of the problem: unknown objective function, high dimensional variable space, constraints on the independent variables, multiple responses, expensive or time-consuming experimental trials, expected complexity of the functional relationships between independent and response variables. The proposed approach iteratively selects a set of experiments by combining a multiobjective Particle Swarm Optimization (PSO) and a multiresponse Multivariate Adaptive Regression Splines (MARS) model. At each iteration of the algorithm the selected experiments are implemented and evaluated, and the system response is used as a feedback for the selection of the new trials. The performance of the approach is measured in terms of improvements with respect to the best coating obtained changing one variable at a time (the method typically used by scientists). Relevant enhancements have been detected, and the proposed evolutionary approach is shown to be a useful methodology for process optimization with great promise for industrial applications. I.
Meta%2Dlearning for data summarization based on instance selection method.

Understanding TSP Difficulty by Learning from Evolved Instances.

Pitfalls in Instance Generation for Udine Timetabling.

A Comprehensive Survey of Data Mining%2Dbased Fraud Detection Research


Context%2Daware fusion A case study on fusion of gait and face for human identification in video.


Facial age estimation by multilinear subspace analysis.

A Knowledge Discovery Approach to Understanding Relationships between Scheduling Problem Structure and Heuristic Performance.

Incremental Learning.
Most existing tracking algorithms construct a representation of a target object prior to the tracking task starts, and utilize invariant features to handle appearance variation of the target caused by lighting, pose, and view angle change. In this paper, we present an efficient and effective online algorithm that incrementally learns and adapts a low dimensional eigenspace representation to reflect appearance changes of the target, thereby facilitating the tracking task. Furthermore, our incremental method correctly updates the sample mean and the eigenbasis, whereas existing incremental subspace update methods ignore the fact the sample mean varies over time. The tracking problem is formulated as a state inference problem within a Markov Chain Monte Carlo framework and a particle filter is incorporated for propagating sample distributions over time. Numerous experiments demonstrate the effectiveness of the proposed tracking algorithm in indoor and outdoor environments where the target objects undergo large pose and lighting changes. 1

On the communal analysis suspicion scoring for identity crime in streaming credit applications.


Facial age estimation by nonlinear aging pattern subspace.

Towards insightful algorithm selection for optimisation using meta%2Dlearning concepts.

Using Supervised and Unsupervised Techniques to Determine Groups of Patients with Different Doctor%2DPatient Stability.

Adaptive Fusion of Gait and Face for Human Identification in Video.

Adaptive Fusion of Gait and Face for Human Identification in Video.

Cross%2Ddisciplinary perspectives on meta%2Dlearning for algorithm selection.

Correction to %22Automatic Age Estimation Based on Facial Aging Patterns%22.
We describe a method for the automatic acquisition of the hyponymy lexical relation from unrestricted text. Two goals motivate the approach: (i) avoidance of the need for pre-encoded knowledge and (ii) applicability across a wide range of text. We identify a set of lexicosyntactic patterns that are easily recognizable, that occur frequently and across text genre boundaries, and that indisputably indicate the lexical relation of interest. We describe a method for discovering these patterns and suggest that other lexical relations will also be acquirable in this way. A subset of the acquisition algorithm is implemented and the results are used to augment and critique the structure of a large hand-built thesaurus. Extensions and applications to areas such as information retrieval are suggested. 1 Introduction  Currently there is much interest in the automatic acquisition of lexical syntax and semantics, with the goal of building up large lexicons for natural language processing. Projects ...
Individual Stable Space An Approach to Face Recognition Under Uncontrolled Conditions.

Meta%2DLearning From Classification to Forecasting%2C to Optimization%2C and Beyond.

Adaptive Spike Detection for Resilient Data Stream Mining.

Automatic Age Estimation Based on Facial Aging Patterns.
While recognition of most facial variations, such as identity, expression and gender, has been exten-sively studied, automatic age estimation has rarely been explored. In contrast to other facial variations, aging variation presents several unique characteristics which make age estimation a challenging task. This paper proposes an automatic age estimation method named AGES (AGing pattErn Subspace). The basic idea is to model the aging pattern, which is defined as the sequence of a particular individual’s face images sorted in time order, by constructing a representative subspace. The proper aging pattern for a previously unseen face image is determined by the projection in the subspace that can reconstruct the face image with minimum reconstruction error, while the position of the face image in that aging pattern will then indicate its age. In the experiments, AGES and its variants are compared with the limited existing age estimation methods (WAS and AAS) and some well-established classification methods (kNN, BP, C4.5, and SVM). Moreover, a comparison with human perception ability on age is conducted. It is interesting to note that the performance of AGES is not only significantly better than that of all the other algorithms, but also comparable to that of the human observers.
Redundant association rules reduction techniques.

Marvin A Heuristic Search Planner with Online Macro%2DAction Learning.
This paper describes Marvin, a planner that competed in the Fourth International Planning Competition (IPC 4). Marvin uses action-sequence-memoisation techniques to generate macroactions, which are then used during search for a solution plan. We provide an overview of its architecture and search behaviour, detailing the algorithms used. We also empirically demonstrate the effectiveness of its features in various planning domains; in particular, the effects on performance due to the use of macro-actions, the novel features of its search behaviour, and the native support of ADL and Derived Predicates. 1.
Network and information security A computational intelligence approach Special Issue of Journal of Network and Computer Applications.

On optimal degree selection for polynomial kernel with support vector machines Theoretical and empirical investigations.

On optimal degree selection for polynomial kernel with support vector machines Theoretical and empirical investigations.

A novel Episodic Associative Memory model for enhanced classification accuracy.

Improved Support Vector Machine Generalization Using Normalized Input Space.

Fuzzy%2Dneuro Web%2DBased Multilingual Knowledge Management.

Communal Detection of Implicit Personal Identity Streams.

Clustering Massive High Dimensional Data with Dynamic Feature Maps.

Clustering Massive High Dimensional Data with Dynamic Feature Maps.

Ontology Learning from Text A Soft Computing Paradigm.

Temporal Representation in Spike Detection of Sparse Personal Identity Streams.

On learning algorithm selection for classification.
The task of constructing composite systems, that is systems composed of more than one part, can be seen as interdisciplinary area which builds on expertise in different domains. The aim of this workshop is to explore the possibilities of constructing such systems with the aid of Machine Learning and exploiting the know-how of Data Mining. One way of producing composite systems is by inducing the constituents and then by putting the individual parts together. For instance, a text extraction system may be composed of various subsystems, some oriented towards tagging, morphosyntactic analysis or word sense disambiguation. This may be followed by selection of informative attributes and finally generation of the system for the extraction of the relevant information. Machine Learning techniques may be employed in various stages of this process. The problem of constructing complex systems can thus be seen as a problem of planning to resolve multiple (possibly interacting) tasks. So, one important issue that needs to be addressed is how these multiple learning processes can be coordinated. Each task is resolved using certain ordering of operations. Meta-learning can be useful in this process. It can help us to retrieve previous solutions conceived in the past and re-use them in new settings. The aim of the workshop is to explore the possibilities of this new area, offer a forum for exchanging ideas and experience concerning the state-of-the art, permit to bring in knowledge gathered in different but related and relevant areas and outline new directions for research. Of particular interest are methods and proposals that address the following issues: • Planning to construct composite systems, • Exploitation of ontologies of tasks and methods, • Representation of learning goals and states in learning, • Control and coordination of learning processes, • Recovering / adapting sequences of DM operations, • Meta-learning and exploitation of meta-knowledge, • Layered learning, • Multi-task learning,
Characteristic%2DBased Clustering for Time Series Data.
With the growing importance of time series clustering research, particularly for similarity searches amongst long time series such as those arising in medicine or finance, it is critical for us to find a way to resolve the outstanding problems that make most clustering methods impractical under certain circumstances. When the time series is very long, some clustering algorithms may fail because the very notation of similarity is dubious in high dimension space; many methods cannot handle missing data when the clustering is based on a distance metric. This paper proposes a method for clustering of time series based on their structural characteristics. Unlike other alternatives, this method does not cluster point values using a distance metric, rather it clusters based on global features extracted from the time series. The feature measures are obtained from each individual series and can be fed into arbitrary clustering algorithms, including an unsupervised neural network algorithm, self-organizing map, or hierarchal clustering algorithm. Global measures describing the time series are obtained by applying statistical operations that best capture the underlying characteristics: trend, seasonality, periodicity, serial correlation, skewness, kurtosis, chaos, nonlinearity, and self-similarity. Since the method clusters using extracted global measures, it reduces the dimensionality of the time series and is much less sensitive to missing or noisy data. We further provide a search mechanism to find the best selection from the feature set that should be used as the clustering inputs. The proposed technique has been tested using benchmark time series datasets previously reported for time series clustering and a set of time series datasets with known characteristics. The empirical results show that our approach is able to yield meaningful clusters. The resulting clusters are similar to those produced by other methods, but with some promising and interesting variations that can be intuitively explained with knowledge of the global characteristics of the time series.
Maximum%2Dentropy estimated distribution model for classification problems.

A meta%2Dlearning approach to automatic kernel selection for support vector machines.

Redundant Association Rules Reduction Techniques.

Computation of Meta%2DLearning Classifiers in Distributed Data Mining using a Novel Cognitive Memory Model.

A Personalized Multilingual Web Content Miner PMWeb Miner.

A Neural Network Model for Hierarchical Multilingual Text Categorization.

Dimension Reduction for Clustering Time Series Using Global Characteristics.
Abstract. Existing methods for time series clustering rely on the actual data values can become impractical since the methods do not easily handle dataset with high dimensionality, missing value, or different lengths. In this paper, a dimension reduction method is proposed that replaces the raw data with some global measures of time series characteristics. These measures are then clustered using a self-organizing map. The proposed approach has been tested using benchmark time series previously reported for time series clustering, and is shown to yield useful and robust clustering. 1
An Efficient Compression Technique for Frequent Itemset Generation in Association Rule Mining.

HDGSOMr A High Dimensional Growing Self%2DOrganizing Map Using Randomness for Efficient Web and Text Mining.

Soft Computing Paradigms for Web Access Pattern Analysis.
Abstract. Web servers play a crucial role to convey knowledge and information to the end users. With the popularity of the WWW, discovering the hidden information about the users and usage or access pattern is critical to determine effective marketing strategies and to optimize the server usage or to accommodate future growth. Many of the currently available or conventional server analysis tools could provide only explicit statistical data without much useful knowledge and hidden information. Therefore, mining useful information becomes a challenging task when the Web traffic volume is enormous and keeps on growing. In this paper, we propose Soft Computing Paradigms (SCPs) to discover Web access or usage patterns from the available statistical data obtained from the Web server log files. Self Organising Map (SOM) is used to cluster the data before the data is fed to three popular SCPs including Takagi Sugeno Fuzzy Inference System (TSFIS), Artificial Neural Networks (ANNs) and Linear Genetic Programming (LGP) to develop accurate access pattern forecast models. The analysis was performed using the Web access log data obtained from the Monash University’s central Web server, which receives over 7 million hits in a week. Empirical results clearly demonstrate that the proposed SCPs could predict the hourly and daily Web traffic volume and the developed TSFIS gave the overall best performance compares with other proposed paradigms.
A Longitudinal Comparison of Supervised and Unsupervised Learning Approaches to Iso%2DResource Grouping for Acute Healthcare in Australia.

Applications of neural networks.

A clustering algorithm based on an estimated distribution model.

Kernal Width Selection for SVM Classification A Meta%2DLearning Approach.

Intelligent web traffic mining and analysis.
With the rapid increasing popularity of the WWW, Websites are playing a crucial role to convey knowledge and information to the end users. Discovering hidden and meaningful information about Web users usage patterns is critical to determine effective marketing strategies to optimize the Web server usage for accommodating future growth. Most of the currently available Web server analysis tools provide only explicitly and statistical information without real useful knowledge for Web managers. The task of mining useful information becomes more challenging when the Web traffic volume is enormous and keeps on growing. In this paper, we propose a concurrent neuro-fuzzy model to discover and analyze useful knowledge from the available Web log data. We made use of the cluster information generated by a self organizing map for pattern analysis and a fuzzy inference system to capture the chaotic trend to provide short-term (hourly) and long-term (daily) Web traffic trend predictions. Empirical results clearly demonstrate that the proposed hybrid approach is efficient for mining and predicting Web server traffic and could be extended to other Web environments as well.
Optimization via Intermittency with a Self%2DOrganizing Neural Network.

Reducing Communication Cost in a Privacy Preserving Distributed Association Rule Mining.

A New Approach of Eliminating Redundant Association Rules.

Improving Risk Grouping Rules for Prostate Cancer Patients with Optimization.
Data mining techniques provide a popular and powerful toolset to address both clinical and management issues in the area of health care. This paper describes the study of assigning prostate cancer patients into homogenous groups with the aim to support future clinical treatment decisions. The cluster analysis based model is suggested and an application of non-smooth nonconvex optimization techniques to solve this model is discussed. It is demonstrated that using the optimization based approach to data mining of a prostate cancer patients database can lead to generation of a significant amount of new knowledge that can be effectively utilized to enhance clinical decision making.
HDGSOM A Modified Growing Self%2DOrganizing Map for High Dimensional Data Clustering.

Personalized Multilingual Web Content Mining.

ODAM An Optimized Distributed Association Rule Mining Algorithm.
Association rule mining is an active data mining research area. However, most ARM algorithms cater to a centralized environment. In contrast to previous ARM algorithms, ODAM is a distributed algorithm for geographically distributed data sets that reduces communication costs. Modern organizations are geographically distributed. Typically, each site locally stores its everincreasing amount of day-to-day data. Using centralized data mining to discover useful patterns in such organizations &#039; data isn&#039;t always feasible because merging data sets from different sites into a centralized site incurs huge network communication costs. Data from these organizations are not only distributed over various locations but also vertically fragmented, making it difficult if not impossible to combine them in a central location. Distributed data mining has thus emerged as an active subarea of data mining research. A significant area of data mining research is association rule mining. Unfortunately, most ARM algorithms 1-9 focus on a sequential or centralized environment where no external communication is required. Distributed ARM algorithms, on the other hand, aim to generate rules from different data sets spread over various geographical sites; hence, they require external communications throughout the
Developing a Personal Multilingual Web Space.

Improving Risk Grouping Rules for Prostate Cancer Patients Using Self%2DOrganizing Maps.

A Self%2DOrganising Neural Network with Intermittent Switching for Combinatorial Optimisation.

An XML Schema Definition for an Operations Research Modeling Language.

Matching SVM Kernel%27s Suitability to Data Characteristics Using Tree by Fuzzy C%2Dmeans Clustering.

Predicting Bad Credit Risk An Evolutionary Approach.

Automatic parameter selection for polynomial kernel.

Performance%2DEnhancing Bifurcations in a Self%2DOrganising Neural Network.

Towards Privacy Preserving Distributed Association Rule Mining.

Improved Web Searching through Neural Network Based Index Generation.

Evolutionary Rule Generation Classification and Its Application to Multi%2Dclass Data.


FOM A Framework for Metaheuristic Optimization.


A Compress%2DBased Association Mining Algorithm for Large Dataset.

Web page clustering using a self%2Dorganizing map of user navigation patterns.
The continuous growth in the size and use of the Internet is creating difficulties in the search for information. A sophisticated method to organize the layout of the information and assist user navigation is therefore particularly important. In this paper, we evaluate the feasibility of using a self-organizing map (SOM) to mine web log data and provide a visual tool to assist user navigation. We have developed LOGSOM, a system that utilizes Kohonen&#039;s self-organizing map to organize web pages into a two-dimensional map. The organization of the web pages is based solely on the users&#039; navigation behavior, rather than the content of the web pages. The resulting map not only provides a meaningful navigation tool (for web users) that is easily incorporated with web browsers, but also serves as a visual analysis tool for webmasters to better understand the characteristics and navigation behaviors of web users visiting their pages. D 2002 Elsevier Science B.V. All rights reserved.
Parallel Fuzzy c%2DMeans Clustering for Large Data Sets.

A Comparison of Supervised and Unsupervised Learning Approaches to ISO%2DResource Grouping for Acute Healthcare in Australia.

Soft Computing Paradigms for Web Access Pattern Analysis.
Abstract. Web servers play a crucial role to convey knowledge and information to the end users. With the popularity of the WWW, discovering the hidden information about the users and usage or access pattern is critical to determine effective marketing strategies and to optimize the server usage or to accommodate future growth. Many of the currently available or conventional server analysis tools could provide only explicit statistical data without much useful knowledge and hidden information. Therefore, mining useful information becomes a challenging task when the Web traffic volume is enormous and keeps on growing. In this paper, we propose Soft Computing Paradigms (SCPs) to discover Web access or usage patterns from the available statistical data obtained from the Web server log files. Self Organising Map (SOM) is used to cluster the data before the data is fed to three popular SCPs including Takagi Sugeno Fuzzy Inference System (TSFIS), Artificial Neural Networks (ANNs) and Linear Genetic Programming (LGP) to develop accurate access pattern forecast models. The analysis was performed using the Web access log data obtained from the Monash University’s central Web server, which receives over 7 million hits in a week. Empirical results clearly demonstrate that the proposed SCPs could predict the hourly and daily Web traffic volume and the developed TSFIS gave the overall best performance compares with other proposed paradigms.
A Neural Clustering Approach to Iso%2DResource for Acute Healthcare in Australia.

Clustering Web User Interests Using Self Organising Maps.

Web Traffic Mining Using a Concurrent Neuro%2DFuzzy Approach.

A Taxonomy for Inter%2DModel Parallelism in High Performance Data Mining.

A Data Mining Architecture for Distributed Environments.

A New Parallel Genetic Algorithm.
Abstract. In this paper a new parallel genetic algorithm for coloring graph vertices is presented. In the algorithm we apply a migration model of parallelism and de ne two new recombination operators SPPX and CEX. For comparison two problem{ oriented crossover operators UISX and GPX are selected. The performance of the algorithm is veri ed by computer experiments on a set of standard graph coloring instances.
Parametric Optimization in Data Mining Incorporated with GA%2DBased Search.

A Data Mining Architecture for Clustered Environments.

Matching Data Mining Algorithm Suitability to Data Characteristics Using a Self%2DOrganizing Map.


A Comparison of GRASP and an Exact Method for Solving a Production and Delivery Scheduling Problem.


Nonlinear System Dynamics in the Normalisation Process of a Self%2DOrganising Neural Network for Combinatorial Optimisation.

Continuous Function Optimisation via Gradient Descent on a Neural Network Approximation Function.

Genetic Line Search.

Modelling the Effect of Premium Changes on Motor Insurance Customer Retention Rates Using Neural Networks.

Cash Flow Forecasting Using Supervised and Unsupervised Neural Networks.

Neural networks in business techniques and applications for the operations researcher.
This paper presents an overview of the di!erent types of neural network models which are applicable when solving business problems. The history of neural networks in business is outlined, leading to a discussion of the current applications in business including data mining, as well as the current research directions. The role of neural networks as a modern operations research tool is discussed.  Scope and purpose  Neural networks are becoming increasingly popular in business. Many organisations are investing in neural network and data mining solutions to problems which have traditionally fallen under the responsibility of operations research. This article provides an overview for the operations research reader of the basic neural network techniques, as well as their historical and current use in business. The paper is intended as an introductory article for the remainder of this special issue on neural networks in business. # 2000 Elsevier Science Ltd. All rights reserved.  Keywords: N...
Experimental analysis of chaotic neural network models for combinatorial optimization under a unifying framework.

A unified framework for chaotic neural%2Dnetwork approaches to combinatorial optimization.

Neural Networks for Combinatorial Optimization A Review of More Than a Decade of Research.
This article briefly summarizes the work that has been done and presents the current standing of neural networks for combinatorial optimization by considering each of the major classes of combinatorial optimization problems. Areas which have not yet been studied are identified for future research.
FPGA Based Implementation of a Hopfield Neural Network for Solving Constraint Satisfaction Problems.
This paper discusses the implementation of Hopfield neural networks for solving constraint satisfaction problems using Field Programmable Gate Arrays (FPGAs). It discusses techniques for formulating such problems as discrete neural networks, and then it describes the N-Queen problem using this formulation. A prototype implementation of the a number of different NQueen problems is described and results are presented that illustrate that a speedup of up to 3 orders of magnitude is possible using current FPGAs devices  1. Introduction  Many practical optimisation problems from business and industry can be formulated as standard mathematical programming problems using binary decision variables. Solution of these problems requires the use of heuristics or approximate algorithms due to the NP-hard nature of their complexity. Neural networks were proposed to solve such problems in 1985 [1], but the field has been plagued with problems of poor solution quality and inability to guarantee feasib...
Neural techniques for combinatorial optimization with applications.
Abstract — After more than a decade of research, there now exist several neural-network techniques for solving NP-hard combinatorial optimization problems. Hopfield networks and selforganizing maps are the two main categories into which most of the approaches can be divided. Criticism of these approaches includes the tendency of the Hopfield network to produce infeasible solutions, and the lack of generalizability of the self-organizing approaches (being only applicable to Euclidean problems). This paper proposes two new techniques which have overcome these pitfalls: a Hopfield network which enables feasibility of the solutions to be ensured and improved solution quality through escape from local minima, and a self-organizing neural network which generalizes to solve a broad class of combinatorial optimization problems. Two sample practical optimization problems from Australian industry are then used to test the performances of the neural techniques against more traditional heuristic solutions. Index Terms—Assembly line, combinatorial optimization, Hopfield networks, hub location, NP-hard, self-organization, sequencing,
Static and Dynamic Channel Assignment Using Neural Networks.

A hybrid neural approach to combinatorial optimization.

